In this paper, we study some new examples of ideals on $$\omega $$ with maximal Tukey type (that is, maximal among partial orders of size continuum). This discussion segues into an examination of a refinement of the Tukey order—known as the weak Rudin–Keisler order—and its structure when restricted to these ideals of maximal Tukey type. Mirroring a result of Fremlin (Note Mat 11:177–214, 1991) on the Tukey order, we also show that there is an analytic P-ideal above all other analytic (...) P-ideals in the weak Rudin–Keisler order. (shrink)

Given a class${\cal C}$of subgroups of a topological groupG, we say that a subgroup$H \in {\cal C}$is auniversal${\cal C}$subgroupofGif every subgroup$K \in {\cal C}$is a continuous homomorphic preimage ofH. Such subgroups may be regarded as complete members of${\cal C}$with respect to a natural preorder on the set of subgroups ofG. We show that for any locally compact Polish groupG, the countable powerGωhas a universalKσsubgroup and a universal compactly generated subgroup. We prove a weaker version of this in the nonlocally compact (...) case and provide an example showing that this result cannot readily be improved. Additionally, we show that many standard Banach spaces have universalKσand compactly generated subgroups. As an aside, we explore the relationship between the classes ofKσand compactly generated subgroups and give conditions under which the two coincide. (shrink)

In an earlier paper, we introduced the following pre-order on the subgroups of a given Polish group: if G is a Polish group and \ are subgroups, we say H is homomorphism reducible to L iff there is a continuous group homomorphism \ such that \\). We previously showed that there is a \ subgroup L of the countable power of any locally compact Polish group G such that every \ subgroup of \ is homomorphism reducible to L. In the (...) present work, we show that this fails in the countable power of the group of increasing homeomorphisms of the unit interval. (shrink)

The present work determines the arithmetic complexity of the index sets of u.c.e. families which are learnable according to various criteria of algorithmic learning. Specifically, we prove that the index set of codes for families that are TxtFex\-learnable is \-complete and that the index set of TxtFex\-learnable and the index set of TxtFext\-learnable families are both \-complete.

We consider some natural sets of real numbers arising in ergodic theory and show that they are, respectively, complete in the classes${\cal D}_2 \left( {{\bf{\Pi }}_3^0 } \right)$and${\cal D}_\omega \left( {{\bf{\Pi }}_3^0 } \right)$, that is, the class of sets which are 2-differences (respectively,ω-differences) of${\bf{\Pi }}_3^0 $sets.